Time-dependent analysis of an M / M / c preemptive priority system with two priority classes

M/M/c Queue with Two Priority Classes

This paper provides the first exact analysis of a preemptive M/M/c queue with two priority classes having different service rates. To perform our analysis, we introduce a new technique to reduce the 2-dimensionally (2D) infinite Markov Chain (MC), representing the two class state space, into a 1-dimensionally (1D) infinite MC, from which the Generating Function (GF) of the number of low-priorit...

The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues

A Queue-Length Cutoff Model for a Preemptive Two-Priority M/M/1 System

Abstract. We consider a two-priority, preemptive, single-server queueing model. Each customer is classified into either a high priority class or a low priority class. The arrivals of the two priority classes follow independent Poisson processes and service time is assumed to be exponentially distributed. A queue-length-cutoff method is considered. Under this discipline the server responds only ...

A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

State Dependent M/M/C/K/N Machining System with Mixed Spares and Removable Repairmen